A Prolific Scheme for Load Balancing Relying on Task Completion Time
نویسندگان
چکیده
منابع مشابه
Aco-based Load Balancing Scheme for Manets
Original scientific paper Routing is one of the most important problems in Mobile Ad-hoc Networks (MANETs). Various techniques have been developed to cope with this problem. Ant-based routing is optimization technique used commonly. Ant-based routing is derived from ant colony optimization, which was inspired by ants. This article recommends a load balancing scheme based on the ant colony. The ...
متن کاملLoad Balancing for Response Time
A centralized scheduler must assign tasks to servers, processing on-line a sequence of task arrivals and departures. Each task runs for an unknown length of time, but comes with a weight that measures resource utilization per unit time. The response time of a server is the sum of the weights of the tasks assigned to it. The goal is to minimize the maximum response time, i.e., load, of any serve...
متن کاملCloud Task Scheduling for Load Balancing based on Intelligent Strategy
Cloud computing is a type of parallel and distributed system consisting of a collection of interconnected and virtual computers. With the increasing demand and benefits of cloud computing infrastructure, different computing can be performed on cloud environment. One of the fundamental issues in this environment is related to task scheduling. Cloud task scheduling is an NP-hard optimization prob...
متن کاملA Performance Study on Load Balancing Algorithms with Task Migration
In this paper, we present a performance study on three diierent load balancing algorithms. The rst algorithm employs only task assignment, whereas the other two allow both task assignment and migration. We conclude that although task migration usually costs more than task assignment, under some situations it can augment task assignment to provide extra performance improvement. This is because t...
متن کاملAn efficient polynomial time approximation scheme for load balancing on uniformly related machines
We consider basic problems of non-preemptive scheduling on uniformly related machines. For a given schedule, defined by a partition of the jobs into m subsets corresponding to the m machines, Ci denotes the completion time of machine i. Our goal is to find a schedule which minimizes or maximizes m
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electrical and Computer Engineering (IJECE)
سال: 2018
ISSN: 2088-8708,2088-8708
DOI: 10.11591/ijece.v8i3.pp1741-1746